Computational experience with the Chow—Yorke algorithm

The Chow—Yorke algorithm is a nonsimplicial homotopy type method for computing Brouwer fixed points that is globally convergent. It is efficient and accurate for fixed point problems. L.T. Watson, T.Y. Li, and C.Y. Wang have adapted the method for zero finding problems, the nonlinear complementarity problem, and nonlinear two-point boundary value problems. Here theoretical justification is given for applying the method to some mathematical programming problems, and computational results are presented.This work was partially supported by NSF Grant MCS 7821337.     

A pointwise convergence for Sobolev space functions

Let 1<p<∞, and k,m be positive integers such that 0(k−2m)pn. Suppose ΩRⁿ is an open set, and Δ is the Laplacian operator. We will show that there is a sequence of positive constants c_j such that for every f in the Sobolev space W^k,p(Ω), for all xΩ except on a set whose Bessel capacity B_k−2m,p is zero.     

A Point Balance Algorithm for the Spherical Code Problem

The Spherical Code (SC) problem has many important applications in such fields as physics, molecular biology, signal transmission, chemistry, engineering and mathematics. This paper presents a bilevel optimization formulation of the SC problem. Based on this formulation, the concept of balanced spherical code is introduced and a new approach, the Point Balance Algorithm (PBA), is presented to search for a 1-balanced spherical code. Since an optimal solution of the SC problem (an extremal spherical code) must be a 1-balanced spherical code, PBA can be applied easily to search for an extremal spherical code. In addition, given a certain criterion, PBA can generate efficiently an approximate optimal spherical code on a sphere in the n-dimensional space ⁿ. Some implementation issues of PBA are discussed and putative global optimal solutions of the Fekete problem in 3, 4 and 5-dimensional space are also reported. Finally, an open question about the geometry of Fekete points on the unit sphere in the 3-dimensional space is posed.     

Solving Nonconvex Planar Location Problems by Finite Dominating Sets

It is well-known that some of the classical location problems with polyhedral gauges can be solved in polynomial time by finding a finite dominating set, i.e. a finite set of candidates guaranteed to contain at least one optimal location.In this paper it is first established that this result holds for a much larger class of problems than currently considered in the literature. The model for which this result can be proven includes, for instance, location problems with attraction and repulsion, and location-allocation problems.Next, it is shown that the approximation of general gauges by polyhedral ones in the objective function of our general model can be analyzed with regard to the subsequent error in the optimal objective value. For the approximation problem two different approaches are described, the sandwich procedure and the greedy algorithm. Both of these approaches lead - for fixed - to polynomial approximation algorithms with accuracy for solving the general model considered in this paper.     

一种相位提取算法误差特性的分析

设计了一种新的相位提取算法，根据推导的评价函数，研究了其误差特性，与传统相位提取算法做了比较分析，其频域特性有了显著提高．分析结果证明该算法对失谐误差不敏感，高阶偶数谐波误差对结果值也不敏感，具有比较优势．仿真实验结果验证了理论预期．     

Small divisor problem for an analytic q-difference equation

Similar to the problem of linearization, the “small divisor problem” also arises in the discussion of invertible analytic solutions of a class of q-difference equations. In this paper we give the existence of such solutions under the Brjuno condition and prove that the equation may not have a nontrivial analytic solution when the Brjuno condition is violated. These results are applied to discussing a nonlinear iterative equation.     

A cubically convergent Newton-type method under weak conditions

Under weak conditions, we present an iteration formula to improve Newton's method for solving nonlinear equations. The method is free from second derivatives, permitting f^′(x)=0 in some points and per iteration it requires two evaluations of the given function and one evaluation of its derivative. Analysis of convergence demonstrates that the new method is cubically convergent. Some numerical examples illustrate that the algorithm is more efficient and performs better than classical Newton's method.     

含弛豫项的广义光学Bloch方程的近似解

本文用叠代法求得了含弛豫项的广义光学Bloch方程的近似解。与计算机给出的数值积分解的比较表明,一阶叠代解具有足够好的精度。由此得出了上能级占有几率随时间变化的解析表达式及多光子吸收、Bloch-Siegert频移等有用结果。     

Stationary Probability Distribution of Colored-noise Saturation Model for a Single-mode Dye Laser

It is applied the interpolation procedure to calculate the stationary probability distribution of colored-gain-noise model of a single-mode dye laser which operates above threshold with correlation time τ covering a very wide rang. By use of Stochastic Runge-Kutta Algorithm, it also has carried out numerical simulations of the steady-state properties. Comparing the results of the interpolation procedure and the unified colored-noise approximation with simulation results, the agreement between the results of the interpolation procedure and simulation results is much better than that of the unified colored-noise approximation when correlation time τ covers range from moderate to large.     

Periodic schedules for linear precedence constraints

We consider the computation of periodic cyclic schedules for linear precedence constraints graphs: a linear precedence constraint is defined between two tasks and induces an infinite set of usual precedence constraints between their executions such that the difference of iterations is a linear function. The objective function is the minimization of the maximal period of a task.We recall first that this problem may be modelled using linear programming. A polynomial algorithm is then developed to solve it for a particular class of linear precedence graphs called unitary graphs. We also show that a periodic schedule may not exist for unitary graphs. In the general case, a decomposition of the linear precedence graph into unitary components is computed and we assume that a periodic schedule exists for each of these components. Lower bounds on the periods are exhibited and we show that an optimal periodic schedule may not achieve them. The notion of quasi-periodic schedule is then introduced and we prove that this new class of schedules always reaches these bounds.